Theoretical computer science

Results: 9916



#Item
181Theoretical computer science / Mathematical logic / Logic / Formal methods / Logic in computer science / Process calculi / -calculus / Automated theorem proving / Process calculus / Lambda calculus / Bisimulation / Limit of a function

to appear in TCS – www.wischik.com/lu/research/explicit-fusions.html Explicit Fusions Lucian Wischik1 and Philippa Gardner2 1 2

Add to Reading List

Source URL: www.wischik.com

Language: English - Date: 2004-02-23 13:34:35
182Category theory / Theoretical computer science / Mathematics / Bisimulation / F-coalgebra / Coinduction / Functor / Coalgebra / Universal property

1. Bisimulation everywhere 2. The power of coinduction 3. More bisimulations, still

Add to Reading List

Source URL: events.inf.ed.ac.uk

Language: English - Date: 2012-10-10 03:52:07
183Phylogenetics / Cladogram / Maximum agreement subtree problem / Tree / Phylogenetic tree / T-tree / Discrete mathematics / Computing / Theoretical computer science

Pattern Identification in Biogeography? Ganeshkumar Ganapathy1, Barbara Goodson2, Robert Jansen2 , Vijaya Ramachandran1, and Tandy Warnow1 1 2

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-08-30 15:58:48
184Computing / Technology / Academia / Distributed computing / Systems / Computer architecture / Scalability / Routing / Internet / Theoretical computer science / Scott Shenker / Complexity

Incentives and Internet Algorithms Joan Feigenbaum Yale University http://www.cs.yale.edu/~jf

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2004-06-08 06:15:27
185String computer science) / Computing / Computer programming / Arrays / Formal languages / LCP array / Suffix array / Combinatorics on words / String / Suffix tree / Trie / Substring

Inducing Suffix and LCP Arrays in External Memory Timo Bingmann∗, Johannes Fischer†, and Vitaly Osipov‡ KIT, Institute of Theoretical Informatics, 76131 Karlsruhe, Germany {timo.bingmann,johannes.fischer,osipov}@ki

Add to Reading List

Source URL: panthema.net

Language: English - Date: 2012-11-28 08:24:55
186Software engineering / Computer programming / Theoretical computer science / Edsger W. Dijkstra / Predicate transformer semantics / IP / NP / Recursion

UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/13/23

Add to Reading List

Source URL: www.dcs.bbk.ac.uk

Language: English - Date: 2014-01-19 15:11:19
187Sorting algorithms / Computer programming / Software engineering / Mathematics / Theoretical computer science / Procedural programming languages / Merge sort / Recursion / Best /  worst and average case / Algorithm / ALGOL 68 / Sort

Outline Big-­O  and  Sorting Lecture   15

Add to Reading List

Source URL: cs.brown.edu

Language: English - Date: 2015-10-29 14:09:05
188Computational complexity theory / Theory of computation / Analysis of algorithms / Operations research / Scheduling / Algorithm / Mathematical logic / Theoretical computer science / Time complexity / NC / Job shop scheduling

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:57
189Formal methods / Theoretical computer science / Software engineering / Mathematics / Hoare logic / Static program analysis / Algorithm / Precondition / Predicate transformer semantics / Loop invariant

Let tests drive or let Dijkstra derive? Presented at ALE2014 in Krakow Poland on August 21, 2014 Author: Sander Kooijmans Date: November 3, 2014 Why this document?

Add to Reading List

Source URL: www.gogognome.nl

Language: English - Date: 2016-04-05 02:15:07
190Theoretical computer science / Logic / Mathematics / Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution / Lambda calculus / Term / Relationships among probability distributions / Centripetal CatmullRom spline

Chapter 2 Untyped Lambda Calculus We assume the existence of a denumerable set VAR of (object) variables x0 , x1 , x2 , . . ., and use x, y, z to range over these variables. Given two variables x1 and x2 , we write x1 =

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2009-12-10 13:51:51
UPDATE